A FAST RANDOMIZED HOUGH TRANSFORM FOR CIRCLE/CIRCULAR ARC RECOGNITION
نویسندگان
چکیده
منابع مشابه
A Fast Randomized Hough Transform for Circle/Circular Arc Recognition
The main drawbacks of the Hough transform (HT) are the heavy requirement of computation and storage. To improve the drawbacks of the HT, the randomized Hough transform (RHT) was proposed. But the RHT is not suitable for detecting the pattern with the complex image because the probability is too low. In this paper, we propose a fast randomized Hough transform for circle/circular arc detection. W...
متن کاملA Fast Randomized Generalized Hough Transform for Arbitrary Shape Detection
The well-known arbitrary shape detection technology, generalized Hough transform (GHT) has the drawbacks of heavy computations (one-to-many or 1-to-n mapping) and storage requirements (voting space and entry number). Some n-to-1 mapping approaches have been proposed for improving the performance of GHT, such as the FGHT (fast generalized Hough transform), ADPHT (Adaptive dual-point Hough transf...
متن کاملFast linear Hough transform
The Hough Transform is the choice technique for identifying straight lines through digital images, with applications to high energy physics and computer vision. Classical methods for implementing the Hough transform of a N N binary image require to compute N3 additions over n = log2(N) bits integers, hence nN3 bit operations per transform. We introduce a new algorithm for computing the fast Hou...
متن کاملFast generalized Hough transform
A fast algorithm for the generalized Hough transform (GHT) based on the use of a hierarchical processing scheme and the inverse generalized Hough operation is proposed. By reducing the size of the image portion which need be processed in the proposed fast GHT, not only the computation time but also the number of processing elements for parallel processing can be reduced. The way to apply the pr...
متن کاملA fast Hough transform for segment detection
The authors describe a new algorithm for the fast Hough transform (FHT) that satisfactorily solves the problems other fast algorithms propose in the literature-erroneous solutions, point redundance, scaling, and detection of straight lines of different sizes-and needs less storage space. By using the information generated by the algorithm for the detection of straight lines, they manage to dete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pattern Recognition and Artificial Intelligence
سال: 2010
ISSN: 0218-0014,1793-6381
DOI: 10.1142/s0218001410007956